Antimony(V) as Acceptors

Using Acceptors as Transducers

We wish to use a given nondeterministic two-way multi-tape acceptor as a transducer by supplying the contents for only some of its input tapes, and asking it to generate the missing contents for the other tapes. We provide here an algorithm for assuring beforehand that this transduction always results in a finite set of answers. We also develop an algorithm for evaluating these answers whenever...

Aromatic rings act as hydrogen bond acceptors.

Simple energy calculations show that there is a significant interaction between a hydrogen bond donor (like the greater than NH group) and the centre of a benzene ring, which acts as a hydrogen bond acceptor. This interaction, which is about half as strong as a normal hydrogen bond, contributes approximately 3 kcal/mol (1 cal = 4.184 J) of stabilizing enthalpy and is expected to play a signific...

Graph-Controlled Grammars as Language Acceptors

In this paper, we study the concept of accepting grammars within various forms of regulated grammars like programmed grammars, matrix (set) grammars, grammars with regular (set) control, periodically time-variant grammars as variants of grammars controlled by bi-coloured digraphs. We focus on their descriptive capacity. In this way, we continue our studies of accepting grammars 1, 2, 3, 11, 13,...

Spiking Neural P Systems Used as Acceptors and Transducers

One-stack Automata as Acceptors of Context-free Languages*

This paper presents one-stack automata as acceptors of context-free languages; these are equivalent to Pushdown Automata which are well known in automata theory. As equivalence relations such as equivalence of Turing Machines and two-stack Pushdown Automata help in learning general properties of formal modeling, the equivalence relation of Pushdown Automata and one-stack automata also helps in ...